<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>My Project: BinarySearchTree.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">My Project
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
  initMenu('',true,false,'search.php','Search');
  $(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">BinarySearchTree.h</div>  </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="preprocessor">#ifndef BINARY_SEARCH_TREE_H</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="preprocessor">#define BINARY_SEARCH_TREE_H</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160; </div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="preprocessor">#include &quot;dsexceptions.h&quot;</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="preprocessor">#include &lt;algorithm&gt;</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="keyword">using namespace </span>std;       </div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160; </div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> Comparable&gt;</div>
<div class="line"><a name="l00011"></a><span class="lineno"><a class="line" href="classBinarySearchTree.html">   11</a></span>&#160;<span class="keyword">class </span><a class="code" href="classBinarySearchTree.html">BinarySearchTree</a></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;{</div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;  <span class="keyword">public</span>:</div>
<div class="line"><a name="l00015"></a><span class="lineno"><a class="line" href="classBinarySearchTree.html#a93b575b9a03bae5a402f69a1a3b96d8f">   15</a></span>&#160;    <a class="code" href="classBinarySearchTree.html#a93b575b9a03bae5a402f69a1a3b96d8f">BinarySearchTree</a>( ) : root{ nullptr }</div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;    {</div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;    }</div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160; </div>
<div class="line"><a name="l00021"></a><span class="lineno"><a class="line" href="classBinarySearchTree.html#a399127538d6b6e1581396cafa5d3aa6e">   21</a></span>&#160;    <a class="code" href="classBinarySearchTree.html#a399127538d6b6e1581396cafa5d3aa6e">BinarySearchTree</a>( <span class="keyword">const</span> <a class="code" href="classBinarySearchTree.html">BinarySearchTree</a> &amp; rhs ) : root{ nullptr }</div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;    {</div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        root = clone( rhs.root );</div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;    }</div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160; </div>
<div class="line"><a name="l00028"></a><span class="lineno"><a class="line" href="classBinarySearchTree.html#af5a89639e88a69c7c8ed757e9a910fdf">   28</a></span>&#160;    <a class="code" href="classBinarySearchTree.html#af5a89639e88a69c7c8ed757e9a910fdf">BinarySearchTree</a>( <a class="code" href="classBinarySearchTree.html">BinarySearchTree</a> &amp;&amp; rhs ) : root{ rhs.root }</div>
<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;    {</div>
<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        rhs.root = <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;    }</div>
<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;    </div>
<div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="classBinarySearchTree.html#a32b5d201d1882fed79be9e0db0a65efc">   34</a></span>&#160;    <a class="code" href="classBinarySearchTree.html#a32b5d201d1882fed79be9e0db0a65efc">~BinarySearchTree</a>( )</div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;    {</div>
<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        makeEmpty( );</div>
<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;    }</div>
<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160; </div>
<div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="classBinarySearchTree.html#a28066217f90c86d362b8db2a00f5c6b1">   42</a></span>&#160;    <a class="code" href="classBinarySearchTree.html">BinarySearchTree</a> &amp; <a class="code" href="classBinarySearchTree.html#a28066217f90c86d362b8db2a00f5c6b1">operator=</a>( <span class="keyword">const</span> <a class="code" href="classBinarySearchTree.html">BinarySearchTree</a> &amp; rhs )</div>
<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;    {</div>
<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        <a class="code" href="classBinarySearchTree.html">BinarySearchTree</a> copy = rhs;</div>
<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        std::swap( *<span class="keyword">this</span>, copy );</div>
<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;    }</div>
<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;        </div>
<div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="classBinarySearchTree.html#ab8c5df2c527a9aff70a5addae99cab2f">   52</a></span>&#160;    <a class="code" href="classBinarySearchTree.html">BinarySearchTree</a> &amp; <a class="code" href="classBinarySearchTree.html#ab8c5df2c527a9aff70a5addae99cab2f">operator=</a>( <a class="code" href="classBinarySearchTree.html">BinarySearchTree</a> &amp;&amp; rhs )</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;    {</div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        std::swap( root, rhs.root );       </div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;    }</div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;    </div>
<div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="classBinarySearchTree.html#a27264b8257042bced77b5a3ed554aca5">   60</a></span>&#160;    <span class="keyword">const</span> Comparable &amp; <a class="code" href="classBinarySearchTree.html#a27264b8257042bced77b5a3ed554aca5">findMin</a>( )<span class="keyword"> const</span></div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;        <span class="keywordflow">if</span>( isEmpty( ) )</div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;            <span class="keywordflow">throw</span> <a class="code" href="classUnderflowException.html">UnderflowException</a>{ };</div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;        <span class="keywordflow">return</span> findMin( root )-&gt;element;</div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;    }</div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160; </div>
<div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="classBinarySearchTree.html#a23eff12a71929966684d056b7ddc89dd">   69</a></span>&#160;    <span class="keyword">const</span> Comparable &amp; <a class="code" href="classBinarySearchTree.html#a23eff12a71929966684d056b7ddc89dd">findMax</a>( )<span class="keyword"> const</span></div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;        <span class="keywordflow">if</span>( isEmpty( ) )</div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;            <span class="keywordflow">throw</span> <a class="code" href="classUnderflowException.html">UnderflowException</a>{ };</div>
<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;        <span class="keywordflow">return</span> findMax( root )-&gt;element;</div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;    }</div>
<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160; </div>
<div class="line"><a name="l00079"></a><span class="lineno"><a class="line" href="classBinarySearchTree.html#a1a234431661b762fd4df77c5c6d0b3b1">   79</a></span>&#160;    <span class="keywordtype">bool</span> <a class="code" href="classBinarySearchTree.html#a1a234431661b762fd4df77c5c6d0b3b1">contains</a>( <span class="keyword">const</span> Comparable &amp; x )<span class="keyword"> const</span></div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;        <span class="keywordflow">return</span> contains( x, root );</div>
<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;    }</div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160; </div>
<div class="line"><a name="l00086"></a><span class="lineno"><a class="line" href="classBinarySearchTree.html#a6b2d9cdc6a90f6dd9cfe753958d5ce1d">   86</a></span>&#160;    <span class="keywordtype">bool</span> <a class="code" href="classBinarySearchTree.html#a6b2d9cdc6a90f6dd9cfe753958d5ce1d">isEmpty</a>( )<span class="keyword"> const</span></div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        <span class="keywordflow">return</span> root == <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;    }</div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160; </div>
<div class="line"><a name="l00093"></a><span class="lineno"><a class="line" href="classBinarySearchTree.html#a8ddd2becc339171650a6fe9ed6481b49">   93</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="classBinarySearchTree.html#a8ddd2becc339171650a6fe9ed6481b49">printTree</a>( ostream &amp; out = cout )<span class="keyword"> const</span></div>
<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;        <span class="keywordflow">if</span>( isEmpty( ) )</div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;            out &lt;&lt; <span class="stringliteral">&quot;Empty tree&quot;</span> &lt;&lt; endl;</div>
<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;            printTree( root, out );</div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;    }</div>
<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160; </div>
<div class="line"><a name="l00102"></a><span class="lineno"><a class="line" href="classBinarySearchTree.html#a1e79b79da19f7cd0a7bc854f746bae7c">  102</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="classBinarySearchTree.html#a1e79b79da19f7cd0a7bc854f746bae7c">makeEmpty</a>( )</div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;    {</div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;        makeEmpty( root );</div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;    }</div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160; </div>
<div class="line"><a name="l00109"></a><span class="lineno"><a class="line" href="classBinarySearchTree.html#a3747b26226a3205295b9b56d51eba9e6">  109</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="classBinarySearchTree.html#a3747b26226a3205295b9b56d51eba9e6">insert</a>( <span class="keyword">const</span> Comparable &amp; x )</div>
<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;    {</div>
<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;        insert( x, root );</div>
<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;    }</div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;     </div>
<div class="line"><a name="l00116"></a><span class="lineno"><a class="line" href="classBinarySearchTree.html#a00c741c480cf0fc2ffd478e66aa5eb55">  116</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="classBinarySearchTree.html#a00c741c480cf0fc2ffd478e66aa5eb55">insert</a>( Comparable &amp;&amp; x )</div>
<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;    {</div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;        insert( std::move( x ), root );</div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;    }</div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;    </div>
<div class="line"><a name="l00123"></a><span class="lineno"><a class="line" href="classBinarySearchTree.html#a27118a2c01d39ccaa07d55a3507d4f24">  123</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="classBinarySearchTree.html#a27118a2c01d39ccaa07d55a3507d4f24">remove</a>( <span class="keyword">const</span> Comparable &amp; x )</div>
<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;    {</div>
<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;        remove( x, root );</div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;    }</div>
<div class="line"><a name="l00129"></a><span class="lineno"><a class="line" href="classBinarySearchTree.html#a6dfb13e00236626dd2ae3a8ccad335a5">  129</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="classBinarySearchTree.html#a6dfb13e00236626dd2ae3a8ccad335a5">add</a>(std::vector&lt;Comparable&gt; &amp;arr)<span class="keyword"> const</span></div>
<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;        <span class="keywordflow">if</span>( isEmpty( ) )</div>
<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;            std::cout &lt;&lt; <span class="stringliteral">&quot;Empty tree&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;            add( root,arr );</div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;    }</div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160; </div>
<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;  <span class="keyword">private</span>:</div>
<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;    <span class="keyword">struct </span>BinaryNode</div>
<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;    {</div>
<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;        Comparable element;</div>
<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;        BinaryNode *left;</div>
<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;        BinaryNode *right;</div>
<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;        BinaryNode( <span class="keyword">const</span> Comparable &amp; theElement, BinaryNode *lt, BinaryNode *rt )</div>
<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;          : element{ theElement }, left{ lt }, right{ rt } { }</div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;        BinaryNode( Comparable &amp;&amp; theElement, BinaryNode *lt, BinaryNode *rt )</div>
<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;          : element{ std::move( theElement ) }, left{ lt }, right{ rt } { }</div>
<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;    };</div>
<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160; </div>
<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;    BinaryNode *root;</div>
<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160; </div>
<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;    <span class="keywordtype">void</span> insert( <span class="keyword">const</span> Comparable &amp; x, BinaryNode * &amp; t )</div>
<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;    {</div>
<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;        <span class="keywordflow">if</span>( t == <span class="keyword">nullptr</span> )</div>
<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;            t = <span class="keyword">new</span> BinaryNode{ x, <span class="keyword">nullptr</span>, <span class="keyword">nullptr</span> };</div>
<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span>( x &lt; t-&gt;element )</div>
<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;            insert( x, t-&gt;left );</div>
<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span>( t-&gt;element &lt; x )</div>
<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;            insert( x, t-&gt;right );</div>
<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;        else</div>
<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;            ;</div>
<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;    }</div>
<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;    </div>
<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;    <span class="keywordtype">void</span> insert( Comparable &amp;&amp; x, BinaryNode * &amp; t )</div>
<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;    {</div>
<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;        <span class="keywordflow">if</span>( t == <span class="keyword">nullptr</span> )</div>
<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;            t = <span class="keyword">new</span> BinaryNode{ std::move( x ), <span class="keyword">nullptr</span>, <span class="keyword">nullptr</span> };</div>
<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span>( x &lt; t-&gt;element )</div>
<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;            insert( std::move( x ), t-&gt;left );</div>
<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span>( t-&gt;element &lt; x )</div>
<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;            insert( std::move( x ), t-&gt;right );</div>
<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;        else</div>
<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;            ;</div>
<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;    }</div>
<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160; </div>
<div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;    <span class="keywordtype">void</span> remove( <span class="keyword">const</span> Comparable &amp; x, BinaryNode * &amp; t )</div>
<div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;    {</div>
<div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;        <span class="keywordflow">if</span>( t == <span class="keyword">nullptr</span> )</div>
<div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;            <span class="keywordflow">return</span>; </div>
<div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;        <span class="keywordflow">if</span>( x &lt; t-&gt;element )</div>
<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;            remove( x, t-&gt;left );</div>
<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span>( t-&gt;element &lt; x )</div>
<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;            remove( x, t-&gt;right );</div>
<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span>( t-&gt;left != <span class="keyword">nullptr</span> &amp;&amp; t-&gt;right != <span class="keyword">nullptr</span> ) </div>
<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;        {</div>
<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;            t-&gt;element = findMin( t-&gt;right )-&gt;element;</div>
<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;            remove( t-&gt;element, t-&gt;right );</div>
<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;        }</div>
<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;        {</div>
<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;            BinaryNode *oldNode = t;</div>
<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;            t = ( t-&gt;left != nullptr ) ? t-&gt;left : t-&gt;right;</div>
<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;            <span class="keyword">delete</span> oldNode;</div>
<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;      }</div>
<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;    }</div>
<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160; </div>
<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;    BinaryNode * findMin( BinaryNode *t )<span class="keyword"> const</span></div>
<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;        <span class="keywordflow">if</span>( t == <span class="keyword">nullptr</span> )</div>
<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;            <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;        <span class="keywordflow">if</span>( t-&gt;left == <span class="keyword">nullptr</span> )</div>
<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;            <span class="keywordflow">return</span> t;</div>
<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;        <span class="keywordflow">return</span> findMin( t-&gt;left );</div>
<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;    }</div>
<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160; </div>
<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;    BinaryNode * findMax( BinaryNode *t )<span class="keyword"> const</span></div>
<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;        <span class="keywordflow">if</span>( t != <span class="keyword">nullptr</span> )</div>
<div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;            <span class="keywordflow">while</span>( t-&gt;right != <span class="keyword">nullptr</span> )</div>
<div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;                t = t-&gt;right;</div>
<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;        <span class="keywordflow">return</span> t;</div>
<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;    }</div>
<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160; </div>
<div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;    <span class="keywordtype">bool</span> contains( <span class="keyword">const</span> Comparable &amp; x, BinaryNode *t )<span class="keyword"> const</span></div>
<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;        <span class="keywordflow">if</span>( t == <span class="keyword">nullptr</span> )</div>
<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span>( x &lt; t-&gt;element )</div>
<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;            <span class="keywordflow">return</span> contains( x, t-&gt;left );</div>
<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span>( t-&gt;element &lt; x )</div>
<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;            <span class="keywordflow">return</span> contains( x, t-&gt;right );</div>
<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;            <span class="keywordflow">return</span> <span class="keyword">true</span>;    <span class="comment">// Match</span></div>
<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;    }</div>
<div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160; </div>
<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;    <span class="keywordtype">void</span> makeEmpty( BinaryNode * &amp; t )</div>
<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;    {</div>
<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;        <span class="keywordflow">if</span>( t != <span class="keyword">nullptr</span> )</div>
<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;        {</div>
<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;            makeEmpty( t-&gt;left );</div>
<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;            makeEmpty( t-&gt;right );</div>
<div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;            <span class="keyword">delete</span> t;</div>
<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;        }</div>
<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;        t = <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;    }</div>
<div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160; </div>
<div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;    <span class="keywordtype">void</span> printTree( BinaryNode *t, ostream &amp; out )<span class="keyword"> const</span></div>
<div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;        <span class="keywordflow">if</span>( t != <span class="keyword">nullptr</span> )</div>
<div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;        {</div>
<div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;            printTree( t-&gt;left, out );</div>
<div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;            out &lt;&lt; t-&gt;element &lt;&lt; endl;</div>
<div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;            printTree( t-&gt;right, out );</div>
<div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;        }</div>
<div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;    }</div>
<div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160; </div>
<div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;    BinaryNode * clone( BinaryNode *t )<span class="keyword"> const</span></div>
<div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;        <span class="keywordflow">if</span>( t == <span class="keyword">nullptr</span> )</div>
<div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;            <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;            <span class="keywordflow">return</span> <span class="keyword">new</span> BinaryNode{ t-&gt;element, clone( t-&gt;left ), clone( t-&gt;right ) };</div>
<div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;    }</div>
<div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;    <span class="keywordtype">void</span> add(BinaryNode *t ,std::vector&lt;Comparable&gt; &amp;arr)<span class="keyword"> const</span></div>
<div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;        <span class="keywordflow">if</span>(t != <span class="keyword">nullptr</span> )</div>
<div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;        {</div>
<div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;            add( t-&gt;left,arr );</div>
<div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;            arr.push_back(t-&gt;element);</div>
<div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;            add( t-&gt;right,arr );</div>
<div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;        }</div>
<div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;    }</div>
<div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;};</div>
<div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="ttc" id="aclassBinarySearchTree_html"><div class="ttname"><a href="classBinarySearchTree.html">BinarySearchTree</a></div><div class="ttdoc">BinarySearchTree的Comparable模板类;.</div><div class="ttdef"><b>Definition:</b> BinarySearchTree.h:12</div></div>
<div class="ttc" id="aclassBinarySearchTree_html_a00c741c480cf0fc2ffd478e66aa5eb55"><div class="ttname"><a href="classBinarySearchTree.html#a00c741c480cf0fc2ffd478e66aa5eb55">BinarySearchTree::insert</a></div><div class="ttdeci">void insert(Comparable &amp;&amp;x)</div><div class="ttdoc">通过调用私有类中的insert函数将传入的Comparable对象的右值引用x插入到BinarySearchTree中;</div><div class="ttdef"><b>Definition:</b> BinarySearchTree.h:116</div></div>
<div class="ttc" id="aclassBinarySearchTree_html_a1a234431661b762fd4df77c5c6d0b3b1"><div class="ttname"><a href="classBinarySearchTree.html#a1a234431661b762fd4df77c5c6d0b3b1">BinarySearchTree::contains</a></div><div class="ttdeci">bool contains(const Comparable &amp;x) const</div><div class="ttdoc">判断x元素是否在BinarySearchTree中;</div><div class="ttdef"><b>Definition:</b> BinarySearchTree.h:79</div></div>
<div class="ttc" id="aclassBinarySearchTree_html_a1e79b79da19f7cd0a7bc854f746bae7c"><div class="ttname"><a href="classBinarySearchTree.html#a1e79b79da19f7cd0a7bc854f746bae7c">BinarySearchTree::makeEmpty</a></div><div class="ttdeci">void makeEmpty()</div><div class="ttdoc">通过调用私有类中的makeEmpty函数清空BinarySearchTree;</div><div class="ttdef"><b>Definition:</b> BinarySearchTree.h:102</div></div>
<div class="ttc" id="aclassBinarySearchTree_html_a23eff12a71929966684d056b7ddc89dd"><div class="ttname"><a href="classBinarySearchTree.html#a23eff12a71929966684d056b7ddc89dd">BinarySearchTree::findMax</a></div><div class="ttdeci">const Comparable &amp; findMax() const</div><div class="ttdoc">找BinarySearchTree类中存储的最小的元素;</div><div class="ttdef"><b>Definition:</b> BinarySearchTree.h:69</div></div>
<div class="ttc" id="aclassBinarySearchTree_html_a27118a2c01d39ccaa07d55a3507d4f24"><div class="ttname"><a href="classBinarySearchTree.html#a27118a2c01d39ccaa07d55a3507d4f24">BinarySearchTree::remove</a></div><div class="ttdeci">void remove(const Comparable &amp;x)</div><div class="ttdoc">通过调用私有类中的remove函数将传入的Comparable对象的引用x从BinarySearchTree中移除;</div><div class="ttdef"><b>Definition:</b> BinarySearchTree.h:123</div></div>
<div class="ttc" id="aclassBinarySearchTree_html_a27264b8257042bced77b5a3ed554aca5"><div class="ttname"><a href="classBinarySearchTree.html#a27264b8257042bced77b5a3ed554aca5">BinarySearchTree::findMin</a></div><div class="ttdeci">const Comparable &amp; findMin() const</div><div class="ttdoc">找BinarySearchTree类中存储的最小的元素;</div><div class="ttdef"><b>Definition:</b> BinarySearchTree.h:60</div></div>
<div class="ttc" id="aclassBinarySearchTree_html_a28066217f90c86d362b8db2a00f5c6b1"><div class="ttname"><a href="classBinarySearchTree.html#a28066217f90c86d362b8db2a00f5c6b1">BinarySearchTree::operator=</a></div><div class="ttdeci">BinarySearchTree &amp; operator=(const BinarySearchTree &amp;rhs)</div><div class="ttdoc">重载=号(赋值)，同时避免了更改rhs的地址;</div><div class="ttdef"><b>Definition:</b> BinarySearchTree.h:42</div></div>
<div class="ttc" id="aclassBinarySearchTree_html_a32b5d201d1882fed79be9e0db0a65efc"><div class="ttname"><a href="classBinarySearchTree.html#a32b5d201d1882fed79be9e0db0a65efc">BinarySearchTree::~BinarySearchTree</a></div><div class="ttdeci">~BinarySearchTree()</div><div class="ttdoc">默认BinarySearchTree析构函数;</div><div class="ttdef"><b>Definition:</b> BinarySearchTree.h:34</div></div>
<div class="ttc" id="aclassBinarySearchTree_html_a3747b26226a3205295b9b56d51eba9e6"><div class="ttname"><a href="classBinarySearchTree.html#a3747b26226a3205295b9b56d51eba9e6">BinarySearchTree::insert</a></div><div class="ttdeci">void insert(const Comparable &amp;x)</div><div class="ttdoc">通过调用私有类中的insert函数将传入的Comparable对象的左值引用x插入到BinarySearchTree中;</div><div class="ttdef"><b>Definition:</b> BinarySearchTree.h:109</div></div>
<div class="ttc" id="aclassBinarySearchTree_html_a399127538d6b6e1581396cafa5d3aa6e"><div class="ttname"><a href="classBinarySearchTree.html#a399127538d6b6e1581396cafa5d3aa6e">BinarySearchTree::BinarySearchTree</a></div><div class="ttdeci">BinarySearchTree(const BinarySearchTree &amp;rhs)</div><div class="ttdoc">有左值传入的BinarySearchTree构造函数;</div><div class="ttdef"><b>Definition:</b> BinarySearchTree.h:21</div></div>
<div class="ttc" id="aclassBinarySearchTree_html_a6b2d9cdc6a90f6dd9cfe753958d5ce1d"><div class="ttname"><a href="classBinarySearchTree.html#a6b2d9cdc6a90f6dd9cfe753958d5ce1d">BinarySearchTree::isEmpty</a></div><div class="ttdeci">bool isEmpty() const</div><div class="ttdoc">判断BinarySearchTree是否为空树;</div><div class="ttdef"><b>Definition:</b> BinarySearchTree.h:86</div></div>
<div class="ttc" id="aclassBinarySearchTree_html_a6dfb13e00236626dd2ae3a8ccad335a5"><div class="ttname"><a href="classBinarySearchTree.html#a6dfb13e00236626dd2ae3a8ccad335a5">BinarySearchTree::add</a></div><div class="ttdeci">void add(std::vector&lt; Comparable &gt; &amp;arr) const</div><div class="ttdoc">通过调用私有类中的add函数将排好序后的元素返回到arr所引用的数组对象;</div><div class="ttdef"><b>Definition:</b> BinarySearchTree.h:129</div></div>
<div class="ttc" id="aclassBinarySearchTree_html_a8ddd2becc339171650a6fe9ed6481b49"><div class="ttname"><a href="classBinarySearchTree.html#a8ddd2becc339171650a6fe9ed6481b49">BinarySearchTree::printTree</a></div><div class="ttdeci">void printTree(ostream &amp;out=cout) const</div><div class="ttdoc">通过调用私有类中的printList函数，用中序遍历将BinarySearchTree树中元素打印出来;</div><div class="ttdef"><b>Definition:</b> BinarySearchTree.h:93</div></div>
<div class="ttc" id="aclassBinarySearchTree_html_a93b575b9a03bae5a402f69a1a3b96d8f"><div class="ttname"><a href="classBinarySearchTree.html#a93b575b9a03bae5a402f69a1a3b96d8f">BinarySearchTree::BinarySearchTree</a></div><div class="ttdeci">BinarySearchTree()</div><div class="ttdoc">默认BinarySearchTree构造函数;</div><div class="ttdef"><b>Definition:</b> BinarySearchTree.h:15</div></div>
<div class="ttc" id="aclassBinarySearchTree_html_ab8c5df2c527a9aff70a5addae99cab2f"><div class="ttname"><a href="classBinarySearchTree.html#ab8c5df2c527a9aff70a5addae99cab2f">BinarySearchTree::operator=</a></div><div class="ttdeci">BinarySearchTree &amp; operator=(BinarySearchTree &amp;&amp;rhs)</div><div class="ttdoc">重载=号(赋值)，swap函数直接交换地址，因为右值对象马上会被释放;</div><div class="ttdef"><b>Definition:</b> BinarySearchTree.h:52</div></div>
<div class="ttc" id="aclassBinarySearchTree_html_af5a89639e88a69c7c8ed757e9a910fdf"><div class="ttname"><a href="classBinarySearchTree.html#af5a89639e88a69c7c8ed757e9a910fdf">BinarySearchTree::BinarySearchTree</a></div><div class="ttdeci">BinarySearchTree(BinarySearchTree &amp;&amp;rhs)</div><div class="ttdoc">有右值传入的BinarySearchTree构造函数;</div><div class="ttdef"><b>Definition:</b> BinarySearchTree.h:28</div></div>
<div class="ttc" id="aclassUnderflowException_html"><div class="ttname"><a href="classUnderflowException.html">UnderflowException</a></div><div class="ttdef"><b>Definition:</b> dsexceptions.h:4</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by&#160;<a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1
</small></address>
</body>
</html>
